Processing Games with Shared Interest

A generalization of processing problems with restricted capacities is introduced.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.The new aspect is that players have interest in all jobs. The corresponding cooperative game of this generalization is proved to be totally balanced.Processing games;scheduling;core allocation

Processing Games with Restricted Capacities

This paper analyzes processing problems and related cooperative games.In a processing problem there is a finite set of jobs, each requiring a specific amount of effort to be completed, whose costs depend linearly on their completion times.There are no restrictions whatsoever on the processing schedule.The main feature of the model is a capacity restriction, i.e., there is a maximum amount of effort per time unit available for handling jobs.Assigning to each job a player and letting each player have an individual capacity for handling jobs, each coalition of cooperating players in fact faces a processing problem with the coalitional capacity being the sum of the individual capacities of the members.The corresponding processing game summarizes the minimal joint costs for every coalition.It turns out that processing games are totally balanced.An explicit core element is constructed.games;capacity;scheduling;cooperation;allocation

Feasibility of EPC to BPEL Model Transformations Based on Ontology and Patterns

Model-Driven Engineering holds the promise of transforming\ud business models into code automatically. This requires the concept of\ud model transformation. In this paper, we assess the feasibility of model\ud transformations from Event-driven Process Chain models to Business\ud Process Execution Language specifications. To this purpose, we use a\ud framework based on ontological analysis and workflow patterns in order\ud to predict the possibilities/limitations of such a model transformation.\ud The framework is validated by evaluating the transformation of several\ud models, including a real-life case.\ud The framework indicates several limitations for transformation. Eleven\ud guidelines and an approach to apply them provide methodological support\ud to improve the feasibility of model transformation from EPC to\ud BPEL

Kinematics of the New Zealand plate boundary: Relative motion by GPS across networks of 1000 km and 50 km spacing

The NASA/DOSE 'Kinematics of the New Zealand Plate Boundary' experiment is a four-year cooperative Global Positioning System (GPS) experiment involving 6 universities and institutions in New Zealand and the United States. The investigation covers two scales, the first on the scale of plates (approximately 1000 km) and the second is on the scale of the plate boundary zone (approximately 50 km). In the first portion of the experiment, phase A, the objective is to make direct measurements of tectonic plate motion between the Australian and Pacific plates using GPS in order to determine the Euler vector of this plate pair. The phase A portion of this experiment was initiated in December 1992 with the first-epoch baseline measurements on the large scale network. The network will be resurveyed two years later to obtain velocities. The stations which were observed for phase A are shown and listed. Additional regional stations which will be used for this study are listed and are part of either CIGNET or other global tracking networks. The phase A portion of the experiment is primarily the responsibility of the UNAVCO investigators. Therefore, this report concentrates on phase A. The first year of NASA funding for phase A included only support for the field work. Processing and analysis will take place with the second year of funding. The second part of the experiemnt measured relative motion between the Australian and Pacific plates across the pate boundary zone between Hokitika and Christchurch on the South Island of New Zealand. The extent and rate of deformation will be determined by comparisons with historical, conventional surveys and by repeated GPS measurements to be made in two years. This activity was the emphasis of the LDGO portion of the study. An ancillary experiment, phase C, concentrated on plate boundary deformation in the vicinity of Wellington and was done as part of training during the early portion of the field campaign. Details of the objectives of the field investigations are given in the appendix. An overview of the 1992 GPS field program is also given in the appendix

Computer-aided detection in musculoskeletal projection radiography: A systematic review

This is the author accepted manuscript. The final version is available from WB Saunders via the DOI in this record.Objectives To investigated the accuracy of computer-aided detection (CAD) software in musculoskeletal projection radiography via a systematic review. Key findings Following selection screening, eligible studies were assessed for bias, and had their study characteristics extracted resulting in 22 studies being included. Of these 22 three studies had tested their CAD software in a clinical setting; the first study investigated vertebral fractures, reporting a sensitivity score of 69.3% with CAD, compared to 59.8% sensitivity without CAD. The second study tested dental caries diagnosis producing a sensitivity score of 68.8% and specificity of 94.1% with CAD, compared to sensitivity of 39.3% and specificity of 96.7% without CAD. The third indicated osteoporotic cases based on CAD, resulting in 100% sensitivity and 81.3% specificity. Conclusion The current evidence reported shows a lack of development into the clinical testing phase; however the research does show future promise in the variation of different CAD systems

On the Core of Routing Games with Revenues

Traveling salesman problems with revenues form a generalization of traveling salesman problems.Here, next to travel costs an explicit revenue is generated by visiting a city.We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along subgroups.Corresponding routing games with revenues are analyzed.It is shown that these games have a nonempty core and a complete description of the core is provided.